Dean List Award Ceremony and Academic Advisor Day 2023

The Dean List Award Ceremony & Academic Advisor Day was held on Saturday, 17th June 2023 from 8.00 AM to 1.00 PM

n-cutting site of DNA splicing language for single string and palindromic rule

A new symbolization of Yusof-Goode (Y-G) splicing system was introduced by Yusof in 2012, is inspired by the framework of Formal Language Theory introduced by Head in 1987. Y-G splicing system is intended to present the biological process of DNA splicing in a translucent way. In this paper, starting with some relevant preliminaries, one theorem is proposed via Y-G approach using one initial string and one rule with different characteristics of the restriction enzyme. Additionally, the theorem showed the behavior of the splicing languages generated at single stage splicing. Two cases are considered in the theorem by conducting splicing using palindromic rule and palindromic recognition site with same left and right context for Case I and different left and right context for Case II. Furthermore, two molecular examples are discussed to validate two cases proposed in the theorem, which shows the real meaning of the theorem in biological aspect. From the proposed theorem, based on the splicing language generated, the type of splicing language can be determined. It is discovered that, the generated languages are in the form of limit and transient

Splicing system in Automata Theory: A review

The study of formal language theory rapidly evolves after Tom Head introduce his research on formal language theory in 1987. Splicing system involves the process of cutting and pasting on DNA molecules with the presence of restriction enzymes and ligase, respectively. A mathematical model of the splicing system has been developed by using the concept of formal language theory, which is a branch of theoretical computer science and applied discrete mathematics, and informational macromolecules. Over the year, theoretical results in splicing systems have contributed to new research in formal language theory focused on modelling of biochemical processes. In this paper, the relation between formal language theory and some related molecular biological terms are explored. In addition, new ideas in the framework of biomolecular science, for example, the design of automated enzymatic processes are then discussed. Then, a mutual relation that exist in these field is then explained. The regular language can be implemented in the splicing system to show the DFA structure in the splicing system

A review on path planning and obstacle avoidance algorithms for autonomous mobile robots

Mobile robots have been widely used in various sectors in the last decade. A mobile robot could autonomously navigate in any environment, both static and dynamic. As a result, researchers in the robotics field have offered a variety of techniques. This paper reviews the mobile robot navigation approaches and obstacle avoidance used so far in various environmental conditions to recognize the improvement of path planning strategists. Taking into consideration commonly used classical approaches such as Dijkstra algorithm (DA), artificial potential field (APF), probabilistic road map (PRM), cell decomposition (CD), and meta-heuristic techniques such as fuzzy logic (FL), neutral network (NN), particle swarm optimization (PSO), genetic algorithm (GA), cuckoo search algorithm (CSO), and artificial bee colony (ABC). Classical approaches have limitations of trapping in local minima, failure to handle uncertainty, and many more. On the other hand, it is observed that heuristic approaches can solve most real-world problems and perform well after some modification and hybridization with classical techniques. As a result, many methods have been established worldwide for the path planning strategy for mobile robots. The most often utilized approaches, on the other hand, are offered below for further study

Various regulations on the existence of n-th order limit language

In molecular biology, recombinant Deoxyribonucleic acid technology has ignited an increase in the interest of new researches. Moreover, the splicing system has generated enthusiasm in developing computational models collaborating with formal language theory. Formal language theory tends to be a natural structure for formalising and investigating DNA computing models from this viewpoint. The work of several researchers who added control structures to the splicing formalism, thus creating universal computation systems, has provided additional inspiration for the study of splicing systems. A splicing system is a conventional model of a set of dsDNA that undergoes the cutting and pasting process with the presence of restriction enzyme and ligase. Previously, an introduction of the n-th order limit language is presented and discussed. The properties and the characteristics of the n-th order limit language are developed and also explained by using examples and sort into a few cases. However, the regulation of the existence of the n-th order limit language is left unintended. In this paper, the factors that restrict the formation of the n-th order limit language are discussed. Several restrictions applied are the length of the rules are not equal and same rules applies on several crossing sites of the initial strings. In addition, some examples are given to show the restriction of the formation of n-order limit language

A review: On path planning optimization criteria and mobile robot navigation

Mobile robots are growing more significant from time to time and have been applied to many fields such as agriculture, space, and even human life. It could improve mobile robot navigation efficiency, ensure path planning safety and smoothness, minimize time execution, etc. The main focus of mobile robots is to have the most optimal functions. An intelligent mobile robot is required to travel autonomously in various environments, static and dynamic. This paper article presents the optimization criteria for mobile robot path planning to figure out the most optimal mobile robot criteria to fulfill, including modeling analysis, path planning and implementation. Path length and path smoothness are the most parameters used in optimization in mobile robot path planning. Based on path planning, the mobile robot navigation is divided into three categories: global navigation, local navigation and personal navigation. Then, we review each category and finally summarize the categories in a map and discuss the future research strategies

An Introduction to n-th Order Limit Language

The study of the splicing system swiftly grew after Tom Head investigated the biochemical process modelling involving the DNA in 1987. The process of the splicing system consists of a cut and paste of the DNA molecules. Splicing language produced by the splicing system can be classified into inert, transient, and limit language. Previously, second-order limit language was described as a new set of language from the previous splicing language. In this research, we would like to extend the study to n-th order limit language by investigating the effect of the number of rules involved in the splicing system. Following from here, its properties are explored using the formal language theory

Deoxyribonucleic acid (DNA) splicing system from graph theoretic perspective

In 1987, Head introduced the recombinant process of deoxyribonucleic acid (DNA) splicing system through a framework of Formal Language Theory. To express this phenomenon, a comprehensive writing system of the rule sets, proper terms and definitions pioneerly introduced by Head. The analysis on the recombinant behavior of double-stranded DNA molecules, characteristics and various type of splicing systems has sparks the researcher to explore more splicing mechanism extensively. The aim of this paper is to give an exhaustive review on the application of graph in DNA splicing system

On the new relation of second order limit language and other different types of splicing system

Mathematical modelling of splicing system has been introduced to initiate a linkage between the study of informational macromolecules that includes DNA and formal language theory. The ability to present the nitrogenous base which is a component in a nucleotide of DNA, as a series of alphabet, ignites this interdisciplinary study. Over the years, researchers have developed models to match their need. In addition, product of splicing system is called splicing language. Through some development, second order limit language is derived from other type of languages known as limit language. Its existence and characteristics have been vastly discussed. Beside, some types of splicing system can produce second order limit language. In this research, the characteristics of varieties of splicing system are studied and their relations with second order limit language are established

An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network

Multiprocessor is another great technology that helps in advancing human civilization due to high demands for solving complex problems. A multiprocessing system can have a lot of replicated processor-memory pairs (henceforth regard as net) or also called as processing nodes. Each of these nodes is connected to each other through interconnection networks and passes message using a standard message passing mechanism. In this paper, we present a routing algorithm based on enhanced simulated annealing technique to provide the connection between nodes in a semi-diagonal torus (SD-Torus) network. This network is both symmetric and regular; thus, make it very beneficial in the implementation process. The main objective is to maximize the number of established connection between nodes in this SD-Torus network. In order to achieve this objective, each node must be connected in its shortest way as possible. We start our algorithm by designing shortest path algorithm based on Dijkstra's method. While this algorithm guarantees to find the shortest path for each single net, if it exists, each routed net will form obstacle for later paths. This increases the complexity to route later nets and makes routing longer than optimal, or sometimes impossible to complete. The solution is further refined by re-routing all nets in different orders using simulated annealing method. Through simulation program, our proposed algorithm succeeded in performing complete routing up to 81 nodes with 40 nets in 9×9 SD-Torus network size